An unconditionally convergent method for computing zeros of splines and polynomials
نویسندگان
چکیده
We present a simple and efficient method for computing zeros of spline functions. The method exploits the close relationship between a spline and its control polygon and is based on repeated knot insertion. Like Newton’s method it is quadratically convergent, but the new method overcomes the principal problem with Newton’s method in that it always converges and no starting value needs to be supplied by the user.
منابع مشابه
Quartic Spline Interpolation
Davis, P. J. Interpolation and approximation, Blaisdell New York 1969 Dikshit,H. P. and Rana, S. S. Cubic Interpolatory splines with non uniform Meshes J. Approx. Theory Vol 45, no4(1985) C. A. Hall and Meyer, W. W. ; Optimal error bounds for cubic spline Interpolation J. Approx. Theory, 58 (1989), 59-67. Kopotun K. A. : Univariate spline equivalence of moduli of smoothness and application . Ma...
متن کاملPolynomials on Banach Spaces with Unconditional Bases
We study the classes of homogeneous polynomials on a Banach space with unconditional Schauder basis that have unconditionally convergent monomial expansions relative to this basis. We extend some results of Matos, and we show that the homogeneous polynomials with unconditionally convergent expansions coincide with the polynomials that are regular with respect to the Banach lattices structure of...
متن کاملUnconditionally Stable Difference Scheme for the Numerical Solution of Nonlinear Rosenau-KdV Equation
In this paper we investigate a nonlinear evolution model described by the Rosenau-KdV equation. We propose a three-level average implicit finite difference scheme for its numerical solutions and prove that this scheme is stable and convergent in the order of O(τ2 + h2). Furthermore we show the existence and uniqueness of numerical solutions. Comparing the numerical results with other methods in...
متن کاملSome compact generalization of inequalities for polynomials with prescribed zeros
Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$. In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$, $k^2 leq rRleq R^2$ and for $Rleq r leq k$. Our results refine and generalize certain well-known polynomial inequalities.
متن کاملUsing Chebyshev polynomial’s zeros as point grid for numerical solution of nonlinear PDEs by differential quadrature- based radial basis functions
Radial Basis Functions (RBFs) have been found to be widely successful for the interpolation of scattered data over the last several decades. The numerical solution of nonlinear Partial Differential Equations (PDEs) plays a prominent role in numerical weather forecasting, and many other areas of physics, engineering, and biology. In this paper, Differential Quadrature (DQ) method- based RBFs are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 76 شماره
صفحات -
تاریخ انتشار 2007